Lattices, Linear Codes, and Invariants, Part II, Volume 47, Number 11
نویسنده
چکیده
1382 NOTICES OF THE AMS VOLUME 47, NUMBER 11 I n Part I of this article we introduced “lattices” L ⊂ Rn and described some of their relations with other branches of mathematics, focusing on “theta functions”. Those ideas have a natural combinatorial analogue in the theory of “linear codes”. This theory, though much more recent than the study of lattices, is more accessible, and its numerous applications include the construction and analysis of many important lattices. A lattice L is a special kind of subgroup of the additive group Rn; in Part I we associated to L a theta function, which is a generating function for the lengths of the vectors of L. A linear code C , to be defined below, is a subgroup of a finite additive group Fn. Analogous to the theta functions of lattices are “weight enumerators” of codes, which are generating functions for the coordinates of elements of C . We shall see how most of the uses and properties of theta functions that we described in Part I have counterparts in the setting of weight enumerators. In particular, just as the theta function θL(τ) associated to a “self-dual lattice” L is invariant under certain fractional linear transformations of the variable τ, we shall encounter “self-dual codes” C with weight enumerators invariant under certain linear transformations of the variables. This invariance yields much information about C , and about an associated self-dual lattice LC and its theta function. As was true of Part I, there is little if any of the mathematics described herein for whose discovery I can claim credit. The one possible exception is the use of theta functions near the end to relate the occurrences of the groups SL2(Z/pZ) and SL2(Z) in the functional equations for weight enumerators and lattices respectively; I know of no published statement of this observation, though it may well be common knowledge in some circles. All other results and ideas I have attributed when their source is known to me, and I apologize in advance for any misor missing attribution.
منابع مشابه
Lattices, Linear Codes, and Invariants, Part I, Volume 47, Number 10
1238 NOTICES OF THE AMS VOLUME 47, NUMBER 10 H ow should 24-dimensional toy merchants most efficiently store their marbles? This is one rather fanciful statement of the “sphere packing problem” in R24. This problem is not just a plaything of high-dimensional Euclidean geometry: it relates to a surprising range of mathematical disciplines, pure as well as applied, including number theory, finite...
متن کاملNotes on some Distance-Based Invariants for 2-Dimensional Square and Comb Lattices
We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...
متن کاملRandom Ensembles of Lattices from Generalized Reductions
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries for i...
متن کاملTurbo Lattices: Construction and Error Decoding Performance
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes i...
متن کاملTurbo Lattices: Construction and Performance Analysis
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested convolutional codes is built. To this end,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000